Simulation and Information: Quantifying over Epistemic Events
نویسندگان
چکیده
We introduce a multi-agent logic of knowledge with time where Fφ stands for “there is an informative event after which φ.” Formula Fφ is true in a model iff it is true in all its refinements (i.e., atoms and back are satisfied; the dual of simulation). The logic is almost normal, and positive knowledge is preserved. The meaning of Fφ is also “after the agents become aware of new factual information, φ is true,” and on finite models it is also “there is an event model (M, s) after which φ.” The former provides a correspondence with bisimulation quantifiers in a setting with epistemic operators.
منابع مشابه
Quantifying the threshold frost hardiness for over-wintering survival of wheat in Iran, using simulation
The value of frost tolerance in wheat is increased with decreasing the temperature in late autumn and/or early winter (phase I, acclimation), then shows plateau state for a period with the coldest temperature (II), finally appears to decrease with warming the temperature (III, de-acclimation). This study was aimed to determine the threshold frost hardiness in wheat for avoiding ...
متن کاملEstimating epistemic and aleatory uncertainties during hydrologic modeling: An information theoretic approach
[1] With growing interest in understanding the magnitudes and sources of uncertainty in hydrological modeling, the difficult problem of characterizing model structure adequacy is now attracting considerable attention. Here, we examine this problem via a model-structureindependent approach based in information theory. In particular, we (a) discuss how to assess and compute the information conten...
متن کاملOn the definability of simulation and bisimulation in epistemic logic
We explore when finite epistemic models are definable up to simulation or bisimulation, either over the basic multi-agent epistemic language L or over its extension L with common knowledge operators. Our main results are the following: 1. Bisimulation to finite epistemic states (i.e., pointed models) is not definable in L. 2. Global bisimulation to finite epistemic models is definable using mod...
متن کاملRobustness-based portfolio optimization under epistemic uncertainty
In this paper, we propose formulations and algorithms for robust portfolio optimization under both aleatory uncertainty (i.e., natural variability) and epistemic uncertainty (i.e., imprecise probabilistic information) arising from interval data. Epistemic uncertainty is represented using two approaches: (1) moment bounding approach and (2) likelihood-based approach. This paper first proposes a ...
متن کاملThe undecidability of group announcements
This paper addresses and solves the long-standing open problem of whether Group Announcement Logic (GAL) is decidable. GAL is a dynamic epistemic logic for reasoning about which states of knowledge a group of agents can make come about by sharing their knowledge, with an operator for quantifying over all truthful public announcements that can be made by the group. We show that the satisfiabilit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008